On the oriented perfect path double cover conjecture

نویسندگان

چکیده مقاله:

‎An  oriented perfect path double cover (OPPDC) of a‎ ‎graph $G$ is a collection of directed paths in the symmetric‎ ‎orientation $G_s$ of‎ ‎$G$ such that‎ ‎each arc‎ ‎of $G_s$ lies in exactly one of the paths and each‎ ‎vertex of $G$ appears just once as a beginning and just once as an‎ ‎end of a path‎. ‎Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete‎ ‎Math‎. ‎276 (2004) 287-294) conjectured that every graph except‎ ‎two complete graphs $K_3$ and $K_5$ has an   OPPDC and they‎ ‎claimed that the minimum degree of the minimal counterexample to‎ ‎this conjecture is at least four‎. ‎In the proof of their claim‎, ‎when a graph is smaller than the minimal counterexample‎, ‎they missed to consider the special cases $K_3$ and $K_5$‎. ‎In this paper‎, ‎among some‎ ‎other results‎, ‎we present the complete proof for this fact‎. ‎Moreover‎, ‎we prove that the minimal counterexample to this‎ ‎conjecture is $2$-connected and $3$-edge-connected‎.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

on the oriented perfect path double cover conjecture

‎an  oriented perfect path double cover (oppdc) of a‎ ‎graph $g$ is a collection of directed paths in the symmetric‎ ‎orientation $g_s$ of‎ ‎$g$ such that‎ ‎each arc‎ ‎of $g_s$ lies in exactly one of the paths and each‎ ‎vertex of $g$ appears just once as a beginning and just once as an‎ ‎end of a path‎. ‎maxov{'a} and ne{v{s}}et{v{r}}il (discrete‎ ‎math‎. ‎276 (2004) 287-294) conjectured that ...

متن کامل

Catherine Greenhill the Cycle Double Cover Conjecture

In the year 2000, exactly one hundred years after David Hilbert posed his now famous list of 23 open problems, The Clay Mathematics Institute (CMI) announced its seven Millennium Problems. (http://www. claymath.org/millennium). The Gazette has asked leading Australian mathematicians to put forth their own favourite ‘Millennium Problem’. Due to the Gazette’s limited budget, we are unfortunately ...

متن کامل

Path decompositions and perfect path double covers

We consider edge-decompositions of regular graphs into isomorphic paths. An m-PPD (perfect path decomposition) is a decomposition of a graph into paths of length m such that every vertex is an end of exactly two paths. An m-PPDC (perfect path double cover) is a covering of the edges by paths of length m such that every edge is covered exactly two times and every vertex is an end of exactly two ...

متن کامل

The Path Partition Conjecture for Oriented Graphs

The vertex set and arc set of a digraph D are denoted by V (D) and E (D), respectively, and the number of vertices in a digraph D is denoted by n (D). A directed cycle (path, walk) in a digraph will simply be called a cycle (path, walk). A graph or digraph is called hamiltonian if it contains a cycle that visits every vertex, traceable if it contains a path that visits every vertex, and walkabl...

متن کامل

On a conjecture of Keedwell and the cycle double cover conjecture

At the 16th British Combinatorial Conference (1997), Cameron introduced a new concept called 2-simultaneous coloring. He used this concept to reformulate a conjecture of Keedwell (1994) on the existence of critical partial latin squares of a given type. Using computer programs, we have veri ed the truth of the above conjecture (the SE conjecture) for all graphs having less than 29 edges. In thi...

متن کامل

On eulerian and regular perfect path double covers of graphs

A perfect path double cover (PPDC) of a graph G is a family P of paths of G such that every edge of G belongs to exactly two paths of P and each vertex of G occurs exactly twice as an endpoint of a path in P. Li (J. Graph Theory 14 (1990) 645–650) has shown that every simple graph has a PPDC.A regular perfect path double cover (RPPDC) of a graph G is a PPDC of G in which all paths are of the sa...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 41  شماره 1

صفحات  189- 200

تاریخ انتشار 2015-02-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023